On second-order characterizability
نویسندگان
چکیده
We investigate the extent of second order characterizable structures by extending Shelah’s Main Gap dichotomy to second order logic. For this end we consider a countable complete first order theory T . We show that all sufficiently large models of T have a characterization up to isomorphism in the extension of second order logic obtained by adding a little bit of infinitary logic if and only if T is shallow superstable with NDOP and NOTOP. Our result relies on cardinal arithmetic assumptions. Under weaker assumptions we get consistency results or alternatively results about second order logic with Henkin semantics.
منابع مشابه
Second-order Characterizable Cardinals and Ordinals Second-order Characterizable Cardinals and Ordinals
The notions of finite and infinite second-order characterizability of cardinal and ordinal numbers are developed. Several known results for the case of finite characterizability are extended to infinite characterizability, and investigations of the secondorder theory of ordinals lead to some observations about the Fraenkel-Carnap question for well-orders and about the relationship between ordin...
متن کاملNon-characterizability of belief revision: an application of finite model theory
A formal framework is given for the characterizability of a class of belief revision operators, defined using minimization over a class of partial preorders, by postulates. It is shown that for partial orders characterizability implies a definability property of the class of partial orders in monadic second-order logic. Based on a non-definability result for a class of partial orders, an exampl...
متن کاملCharacterizability in Belief Revision
A formal framework is given for the postulate characterizability of a class of belief revision operators, obtained from a class of partial preorders using minimization. It is shown that for classes of posets characterizability is equivalent to a special kind of definability in monadic second-order logic, which turns out to be incomparable to first-order definability. Several examples are given ...
متن کاملCharacterizability of Finite Simple Groups by their Order Components: A Summary of Results
Let G be a finite group and let OC(G) be the set of order components of G. The number of non-isomorphic classes of finite groups H satisfying OC(G) = OC(H) is denoted by h(G). If h(G) = k then G is called a k-recognizable group by the set of its order components and if k = 1, G is called a recognizable group. The main consequence of recognizability of a group G by its order components is the va...
متن کاملOne-shot learning and the polynomial characterizability barrier
We survey two existing algorithms for the inference of finite-state tree automata from membership queries and a finite positive sample or equivalence queries, and we suggest a correction for one of them which we deem necessary in order to ensure its termination. We present two algorithms for the same two settings when the underlying description is not a deterministic but a residual canonical fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Logic Journal of the IGPL
دوره 21 شماره
صفحات -
تاریخ انتشار 2013